SOME ITERATIVE REGULARIZED METHODS FOR HIGHLY NONLINEAR LEAST SQUARES PROBLEMS
نویسندگان
چکیده
منابع مشابه
Preconditioned Iterative Methods for Solving Linear Least Squares Problems
New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the CGLS method are described. First, direct preconditioning of the normal equations by the Balanced Incomplete Factorization (BIF) for symmetric and positive definite matrices is studied and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU fa...
متن کاملPreconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems
We consider the iterative solution of weighted Toeplitz least squares problems. Our approach is based on an augmented system formulation. We focus our attention on two types of preconditioners: a variant of constraint preconditioning, and the Hermitian/skew-Hermitian splitting (HSS) preconditioner. Bounds on the eigenvalues of the preconditioned matrices are given in terms of problem and algori...
متن کاملGauss-Seidel Iterative Methods for Rank Deficient Least Squares Problems
We study the semiconvergence of Gauss-Seidel iterative methods for the least squares solution of minimal norm of rank deficient linear systems of equations. Necessary and sufficient conditions for the semiconvergence of the Gauss-Seidel iterative method are given. We also show that if the linear system of equations is consistent, then the proposed methods with a zero vector as an initial guess ...
متن کاملApproximate Gauss-Newton Methods for Nonlinear Least Squares Problems
The Gauss–Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملTensor Methods for Large, Sparse Nonlinear Least Squares Problems
This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by nite diier-ence approximations. Tensor methods have been shown to have very good computational performance for small to medium-sized, dense nonlinear least squares problems. In this paper we consider the application of tensor metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Modelling and Analysis
سال: 2009
ISSN: 1392-6292,1648-3510
DOI: 10.3846/1392-6292.2009.14.179-186